Logics of Imperfect Information without Identity

نویسنده

  • Antti Kuusisto
چکیده

We investigate the expressive power of sentences of the family of independence-friendly (IF) logics in the equality-free setting. Various natural equality-free fragments of logics in this family translate into the version of existential second-order logic with prenex quantification of function symbols only and with the first-order parts of formulae equality-free. We study this version of existential second-order logic. Our principal result is that over finite models with a vocabulary consisting of unary relation symbols only, this fragment of second-order logic is weaker in expressive power than first-order logic. Such results could turn out useful in the study of independence-friendly modal logics. In addition to proving results of a technical nature, we consider issues related to a perspective where IF logic is regarded as a specification framework for games, and also discuss the significance of understanding fragments of second-order logic in investigations related to non-classical logics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inclusion and exclusion dependencies in team semantics - On some logics of imperfect information

We introduce some new logics of imperfect information by adding atomic formulas corresponding to inclusion and exclusion dependencies to the language of first order logic. The properties of these logics and their relationships with other logics of imperfect information are then studied. Furthermore, a game theoretic semantics for these logics is developed. As a corollary of these results, we ch...

متن کامل

Model-checking games for logics of imperfect information

Logics of dependence and independence have semantics that, unlike Tarski semantics, are not based on single assignments (mapping variables to elements of a structure) but on sets of assignments. Sets of assignments are called teams and the semantics is called team semantics. We design model-checking games for logics with team semantics in a general and systematicway. The constructionworks for a...

متن کامل

Games and Logics of Knowledge for Multi-agent Systems

New types of knowledge constructions in epistemic logic are defined, whose semantics is given by a combination of game-theoretic notions and modal semantics. A new notion of knowledge introduced in this framework is focussed knowledge, which arises from the game-theoretic phenomenon of imperfect information in quantified versions of epistemic logics. This notion is shown to be useful in knowled...

متن کامل

Constructive knowledge: what agents can achieve under imperfect information

We propose a non-standard interpretation of Alternating-time Temporal Logic with imperfect information, for which no commonly accepted semantics has been proposed yet. Rather than changing the semantic structures, we generalize the usual interpretation of formulae in single states to sets of states. We also propose a new epistemic operator for “practical” or “constructive” knowledge, and we sho...

متن کامل

New results on pushdown module checking with imperfect information

Model checking of open pushdown systems (OPD) w.r.t. standard branching temporal logics (pushdown module checking or PMC) has been recently investigated in the literature, both in the context of environments with perfect and imperfect information about the system (in the last case, the environment has only a partial view of the system’s control states and stack content). For standard CTL, PMC w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011